Optimizing multidimensional index trees for main memory access
نویسندگان
چکیده
منابع مشابه
Parallelizing multidimensional indexes for main memory databases
Parallelizing multidimensional indexes for main memory databases Master thesis,
متن کاملData Placement for Efficient Main Memory Access
The main memory system is a critical component of modern computer systems. Dynamic Random Access Memory (DRAM) based memory designs dominate the industry due to mature device technology and low cost. These designs, however, face several challenges moving forward. These challenges arise due to legacy DRAM device design choices, advances in Central Processing Unit (CPU) design, and the demand for...
متن کاملOptimizing Main-Memory Join on Modern Hardware
ÐIn the past decade, the exponential growth in commodity CPU's speed has far outpaced advances in memory latency. A second trend is that CPU performance advances are not only brought by increased clock rate, but also by increasing parallelism inside the CPU. Current database systems have not yet adapted to these trends and show poor utilization of both CPU and memory resources on current hardwa...
متن کاملMultidimensional Access Methods: Trees Have Grown Everywhere
This paper is a survey of work and issues on multidimensional search trees. We provide a classification of such methods, we describe the related algorithms, we present performance analysis efforts, and finally outline future research directions. Multi-dimensional search trees and Spatial Access Methods, in general, are designed to handle spatial objects, like points, line segments, polygons, po...
متن کاملA Snappy B+-Trees Index Reconstruction for Main-Memory Storage Systems
A main memory system employs a main memory rather than a disk as a primary storage and efficiently supports various real time applications that require high performance. The time to recover the system from failure needs to be shortened for real time service, and fast index reconstruction is an essential step for data recovery. In this paper, we present a snappy B+-Tree reconstruction algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 2001
ISSN: 0163-5808
DOI: 10.1145/376284.375679